A New Modified Gradient-Projection Algorithm for Solution of Constrained Convex Minimization Problem in Hilbert Spaces
نویسندگان
چکیده
Manuscript received January 01, 2014; revised March 28, 2014. This work was supported in part by King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia. Cyril Dennis Enyi is with King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia. (corresponding author: +966550782390; e-mail: cenyi@ kfupm.edu.sa). Mukiawa Edwin Soh is with King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia. (e-mail: [email protected]). is called monotone if there exists such that 〈 〉 ‖ ‖ ∈ is called monotone if there exists such that 〈 〉 ‖ ‖ ∈ also is if there exists such that for all ∈ ‖ ‖ ‖ ‖. Definition 1.4 A mapping is said to be firmly nonexpansive if is nonexpansive, or equivalently 〈 〉 ‖ ‖ ∈ Alternatively, is firmly nonexpansive if can be
منابع مشابه
A General Iterative Method for Constrained Convex Minimization Problems in Hilbert Spaces
It is well known that the gradient-projection algorithm plays an important role in solving constrained convex minimization problems. In this paper, based on Xu’s method [Xu, H. K.: Averaged mappings and the gradient-projection algorithm, J. Optim. Theory Appl. 150, 360-378(2011)], we use the idea of regularization to establish implicit and explicit iterative methods for finding the approximate ...
متن کاملStrong convergence of modified gradient-projection algorithm for constrained convex minimization problems
In this article, a modified gradient-projection algorithm (GPA) is introduced, which combines Xu’s idea of an alternative averaged mapping approach to the GPA and the general iterative method for nonexpansive mappings in Hilbert space introduced by Marino and Xu. Under suitable conditions, it is proved that the strong convergence of the sequences generated by implicit and explicit schemes to a ...
متن کاملStrong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کاملAveraged Mappings and the Gradient-Projection Algorithm
It is well known that the gradient-projection algorithm (GPA) plays an important role in solving constrained convex minimization problems. In this article, we first provide an alternative averaged mapping approach to the GPA. This approach is operator-oriented in nature. Since, in general, in infinite-dimensional Hilbert spaces, GPA has only weak convergence, we provide two modifications of GPA...
متن کاملA Hybrid Gradient-Projection Algorithm for Averaged Mappings in Hilbert Spaces
It is well known that the gradient-projection algorithm GPA is very useful in solving constrained convex minimization problems. In this paper, we combine a general iterative method with the gradient-projection algorithm to propose a hybrid gradient-projection algorithm and prove that the sequence generated by the hybrid gradient-projection algorithm converges in norm to a minimizer of constrain...
متن کامل